Extending Mixed Criticality Scheduling

نویسنده

  • Thomas D Fleming
چکیده

The capability of hardware is constantly developing in capacity, speed and efficiency. This development has sparked industrial and academic interest in how best to utilise the increased capability. It is now possible to integrate many systems that in the past might have existed as different nodes, into the one consolidated architecture. This desire to centralise functionality leads to the potential of a system that contains software components of differing levels of importance or criticality. Such Mixed Criticality Systems pose a challenging problem with regard to analysis and certification. Much work has been undertaken investigating the use of Fixed Priority scheduling for Mixed Criticality Systems, a notable scheme, known as Adaptive Mixed Criticality (AMC), provides significant advances in schedulability over prior approaches. The focus of the work on AMC revolves around just two levels of criticality. In this work we develop extensions to consider greater than two levels of criticality, for both forms of AMC analysis (AMCrtb & AMCmax) and consider the implication of applying these extended approaches. Alongside this we adapt some of the schemes developed prior to AMC in order to assess their relative effectiveness. We also review and further develop Period Transformation for use with Mixed Criticality Systems. Finally we provide a set of evaluations to illustrate the results. We conclude that AMC maintains its effectiveness over many criticality levels and remains an effective scheme. Of the two forms of analysis, AMCrtb is the most practical as the schedulability improvement gained by using AMCmax is slight and the increase in computation required is extreme. When considering an arbitrary number of criticality levels AMCrtb is a dependable, comprehensive scheme.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Virtually Exclusive Resources

Independence preservation, a desirable property in realtime locking protocols that isolates tasks from delays due to unrelated critical sections, is formalized. It is shown that independence preservation is impossible if temporary job migrations are disallowed. The OMIP, a new, asymptotically optimal, independence-preserving locking protocol for clustered scheduling based on migratory priority ...

متن کامل

Investigating Mixed Criticality Cyclic Executive Schedule Generation

Mixed Criticality systems require a difficult compromise to be drawn between efficient system utilisation and sufficient separation of critical components. In addition to these challenges, hardware platforms are becoming increasingly multicore in nature bringing up additional scheduling issues. Previous publications have met these challenges by suggesting a Cyclic Executive based approach for M...

متن کامل

Towards Compositional Mixed-Criticality Real-Time Scheduling in Open Systems

Although many cyber-physical systems are both mixed-criticality system and compositional system, there are little work on intersection of mixed-criticality system and compositional system. We propose novel concepts for task-level criticality mode and reconsider temporal isolation in terms of compositional mixed-criticality scheduling.

متن کامل

Improving the Quality-of-Service for Scheduling Mixed-Criticality Systems on Multiprocessors

The traditional Vestal’s model of Mixed-Criticality (MC) systems was recently extended to Imprecise Mixed-Critical task model (IMC) to guarantee some minimum level of (degraded) service to the low-critical tasks even after the system switches to the high-critical behavior. This paper extends the IMC task model by associating specific Quality-of-Service (QoS) values with the low-critical tasks a...

متن کامل

On the Expressiveness of Fixed-Priority Scheduling Contexts for Mixed-Criticality Scheduling

Scheduling contexts allow flattening hierarchical schedules in virtualized mixed-criticality setups. However, their expressiveness in terms of supported higher-level scheduling algorithms is not yet well understood. This paper makes a first step in this direction by investigating how recently proposed mixed-criticality algorithms can be mapped to fixed-priority scheduling contexts and how sched...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013